b(a(a(x1))) → a(b(c(x1)))
c(a(x1)) → a(c(x1))
c(b(x1)) → b(a(x1))
L(a(a(x1))) → L(a(b(c(x1))))
c(R(x1)) → b(a(R(x1)))
↳ QTRS
↳ DependencyPairsProof
b(a(a(x1))) → a(b(c(x1)))
c(a(x1)) → a(c(x1))
c(b(x1)) → b(a(x1))
L(a(a(x1))) → L(a(b(c(x1))))
c(R(x1)) → b(a(R(x1)))
C(R(x1)) → B(a(R(x1)))
L1(a(a(x1))) → C(x1)
C(a(x1)) → C(x1)
L1(a(a(x1))) → L1(a(b(c(x1))))
B(a(a(x1))) → B(c(x1))
B(a(a(x1))) → C(x1)
L1(a(a(x1))) → B(c(x1))
C(b(x1)) → B(a(x1))
b(a(a(x1))) → a(b(c(x1)))
c(a(x1)) → a(c(x1))
c(b(x1)) → b(a(x1))
L(a(a(x1))) → L(a(b(c(x1))))
c(R(x1)) → b(a(R(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
C(R(x1)) → B(a(R(x1)))
L1(a(a(x1))) → C(x1)
C(a(x1)) → C(x1)
L1(a(a(x1))) → L1(a(b(c(x1))))
B(a(a(x1))) → B(c(x1))
B(a(a(x1))) → C(x1)
L1(a(a(x1))) → B(c(x1))
C(b(x1)) → B(a(x1))
b(a(a(x1))) → a(b(c(x1)))
c(a(x1)) → a(c(x1))
c(b(x1)) → b(a(x1))
L(a(a(x1))) → L(a(b(c(x1))))
c(R(x1)) → b(a(R(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
C(a(x1)) → C(x1)
B(a(a(x1))) → B(c(x1))
B(a(a(x1))) → C(x1)
C(b(x1)) → B(a(x1))
b(a(a(x1))) → a(b(c(x1)))
c(a(x1)) → a(c(x1))
c(b(x1)) → b(a(x1))
L(a(a(x1))) → L(a(b(c(x1))))
c(R(x1)) → b(a(R(x1)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
C(a(x1)) → C(x1)
B(a(a(x1))) → B(c(x1))
B(a(a(x1))) → C(x1)
C(b(x1)) → B(a(x1))
The value of delta used in the strict ordering is 1/16.
POL(C(x1)) = 1/4 + x_1
POL(c(x1)) = 1/4 + (4)x_1
POL(B(x1)) = (1/4)x_1
POL(a(x1)) = 1/4 + (4)x_1
POL(b(x1)) = x_1
POL(R(x1)) = 0
b(a(a(x1))) → a(b(c(x1)))
c(a(x1)) → a(c(x1))
c(b(x1)) → b(a(x1))
c(R(x1)) → b(a(R(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
b(a(a(x1))) → a(b(c(x1)))
c(a(x1)) → a(c(x1))
c(b(x1)) → b(a(x1))
L(a(a(x1))) → L(a(b(c(x1))))
c(R(x1)) → b(a(R(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
L1(a(a(x1))) → L1(a(b(c(x1))))
b(a(a(x1))) → a(b(c(x1)))
c(a(x1)) → a(c(x1))
c(b(x1)) → b(a(x1))
L(a(a(x1))) → L(a(b(c(x1))))
c(R(x1)) → b(a(R(x1)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
L1(a(a(x1))) → L1(a(b(c(x1))))
The value of delta used in the strict ordering is 15/4.
POL(c(x1)) = 1/4 + (4)x_1
POL(L1(x1)) = x_1
POL(a(x1)) = 1 + (4)x_1
POL(b(x1)) = (1/4)x_1
POL(R(x1)) = 0
b(a(a(x1))) → a(b(c(x1)))
c(a(x1)) → a(c(x1))
c(b(x1)) → b(a(x1))
c(R(x1)) → b(a(R(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
b(a(a(x1))) → a(b(c(x1)))
c(a(x1)) → a(c(x1))
c(b(x1)) → b(a(x1))
L(a(a(x1))) → L(a(b(c(x1))))
c(R(x1)) → b(a(R(x1)))